Using SVG and XSLT for graphic representation

Using SVG and XSLT for graphic representation In this paper we will present an XML based framework that can be used to produce graphical visualisation of scientific data. The approach rather than producing ordinary histogram and function diagaram graphs, tries to represent the information in a more graphical appealing and easy to understand way. For examples the approach will give the ability to represent the temperature as the level of coulored fluid in a thermometer. The proposed framework is able to maintain the value of the datas strictly separated from the visual form of its representation (positions of element, colours, visual representation etc.). By defining appropriate data structures and expressing them using XML, the framework gives the user the ability to create graphic representations using standard SVG and XSLT. Since XML can be used for describing complex data information, we represent every level of the graphic representation with an XML structure. To describe our architecture we defined the following XML dialects, each one with different markup tags, reflecting the semantical values of the elements. Data definition level. Used to define the value of the datas that can be used in the graphic representation Data representation level. Used to define the graphic representation, it defines how the values expressed by the data definition level are represented. Both data representation and data definition files are based on a DTD to impose the constraints. Data representation level is the core of the system, and defines a powerful language for representation. Source primitives. Used to define for the source of the graphic elements, for example static file or SVG code. Modification primitives. Used to define the modifications that can affect a graphic element, for example rotation, scaling or repetition. Disposition primitives. Used to define the possible dispositions along x, y and z axes, for example to impose a order in the representation of elements. Action primitives. Used to define the possible actions that canbe activated by graphic elements for different user behaviours. For example a mouse action can activate a link to a different resource, or can change the value of any of the other primitives of the data structure, as image source or disposition, or can show a tooltip . XSLT is used to output a SVG file derived from the two files describing the graphic representation. Our aim is to provide an abstract language to be used to represent in different ways the same concept. In fact, we can link a data definition file with different data representation levels, providing different kinds and levels of complexity for the same concept. An example use could be the representation of the temperature described before, where the temperature itself could be represented either as the level of mercury in the termomether, or as the rotation of an arrow in a gauge. The transformation process is made from an XML source tree into an XML result tree, using XPath to define patterns. XSLT transformation process is based on templates, that define some actions (like adding or removing elements, or sorting them) to be performed when a part of the document matches a template. To implement some of the complex graphics operations we are using XSLT extensions that allow to perform mathematical operations. These XSLT extensions are not yet standard and require specific compliant parser, as Apache Xalan, that allows the developer to interface with Java classes in order to increase XSLT areas of application, from simple node transformations to quite complex operations

Performance Analysis of the ARIA Adaptive Media Processing Workflows using Colored Petri Nets

AbstractMultimedia systems are one of the most complex and interesting applications that are nowadays proposed to the users. Their complexity derives mainly from the fact that multimedia systems have to process huge amounts of data, while respecting real-time deadlines. For this reason performance evaluation of the underlaying workflow is a key issue in the design process of a new Multimedia system.In this paper we consider the ARchitecture for Interactive Arts (ARIA), an adaptive media processing workflow, developed at the Arizona State University, and outline a semi-automatic procedure to translate its specification into Colored Petri Nets. We then provide guidelines on how to compute the parameters for the performance models, and apply the proposed methodology to a realistic example of a face recognition application

Fragile Watermarking of 3D Models in Transformed Domain

This paper presents an algorithm aimed at the integrity protection of 3D models represented as a set of vertices and polygons. The proposed method defines a procedure to perform a fragile watermarking of the vertices’ data, namely 3D coordinates and polygons, introducing a very small error in the vertices’ coordinates. The watermark bit string is embedded into a secret vector space defined by the Karhunen–Loève transform derived from a key image. Experimental results show the good performance of the method and its security

Fluid Petri Nets for the Performance Evaluation of MapReduce Applications

Big Data applications allow to successfully analyze large amounts of data not necessarily structured, though at the same time they present new challenges. For example, predicting the performance of frameworks such as Hadoop can be a costly task, hence the necessity to provide models that can be a valuable support for designers and developers. This paper provides a new contribution in studying a novel modeling approach based on fluid Petri nets to predict MapReduce jobs execution time. The experiments we performed at CINECA, the Italian supercomputing center, have shown that the achieved accuracy is within 16% of the actual measurements on average

The Novel hDHODH Inhibitor MEDS433 Prevents Influenza Virus Replication by Blocking Pyrimidine Biosynthesis

The pharmacological management of influenza virus (IV) infections still poses a series of challenges due to the limited anti-IV drug arsenal. Therefore, the development of new anti-influenza agents effective against antigenically different IVs is therefore an urgent priority. To meet this need, host-targeting antivirals (HTAs) can be evaluated as an alternative or complementary approach to current direct-acting agents (DAAs) for the therapy of IV infections. As a contribution to this antiviral strategy, in this study, we characterized the anti-IV activity of MEDS433, a novel small molecule inhibitor of the human dihydroorotate dehydrogenase (hDHODH), a key cellular enzyme of the de novo pyrimidine biosynthesis pathway. MEDS433 exhibited a potent antiviral activity against IAV and IBV replication, which was reversed by the addition of exogenous uridine and cytidine or the hDHODH product orotate, thus indicating that MEDS433 targets notably hDHODH activity in IV-infected cells. When MEDS433 was used in combination either with dipyridamole (DPY), an inhibitor of the pyrimidine salvage pathway, or with an anti-IV DAA, such as N(4)-hydroxycytidine (NHC), synergistic anti-IV activities were observed. As a whole, these results indicate MEDS433 as a potential HTA candidate to develop novel anti-IV intervention approaches, either as a single agent or in combination regimens with DAAs

Multi-class queuing networks models for energy optimization

The increase of energy consumption and the related costs in large data centers has stimulated new researches on techniques to optimize the power consumption of the servers. In this paper we focus on systems that should process a peak workload consisting of different classes of applications. The objective is to implement a policy of load control which allows an efficient use of the power deployed to the resources. The proposed strategy controls the workload mix in order to achieve the maximum utilization of all the resources allocated. As a consequence, the power provision will be fully utilized and the throughput maximized. Thus, the costs to execute a given workload will be minimized, together with its energy consumption, since the required processing time is decreased